On the X-join decomposition for undirected graphs
نویسندگان
چکیده
منابع مشابه
The automorphism group of the reduced complete-empty $X-$join of graphs
Suppose $X$ is a simple graph. The $X-$join $Gamma$ of a set ofcomplete or empty graphs ${X_x }_{x in V(X)}$ is a simple graph with the following vertex and edge sets:begin{eqnarray*}V(Gamma) &=& {(x,y) | x in V(X) & y inV(X_x) },\ E(Gamma) &=& {(x,y)(x^prime,y^prime) | xx^prime in E(X) or else x = x^prime & yy^prime in E(X_x)}.end{eqnarray*}The $X-$join graph $Gamma$ is said to be re...
متن کاملOn undirected Cayley graphs
We determine all periodic (and, therefore, all finite) semigroups G for which there exists a non-empty subset S of G such that the Cayley graph of G relative to S is an undirected Cayley graph. Let G be a semigroup, and let S be a nonempty subset of G. The Cayley graph Cay(G,S) of G relative to S is defined as the graph with vertex set G and edge set E(S) consisting of those ordered pairs (x, y...
متن کاملThe locating chromatic number of the join of graphs
Let $f$ be a proper $k$-coloring of a connected graph $G$ and $Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $Pi$ is defined to be the ordered $k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$, where $d(v,V_i)=min{d(v,x):~xin V_i}, 1leq ileq k$. If distinct...
متن کاملA Simple Linear Time Split Decomposition Algorithm of Undirected Graphs
We revisit the problem of designing a linear time algorithm for undirected graph split decomposition. Although that this problem has already been claimed to be solved in [E. Dahlhaus, FSTTCS, 1994] and [E. Dahlhaus, Journal of Algorithms 36(2):205-240, 2000], we present a new well founded theoretical background for split decomposition that allow us to clearly design and proove the rst simple li...
متن کاملRandom Walks on Undirected Graphs
Thus the probability that the process is in a particular “state” y at time t depends only on its state x at time t − 1; this probability is denoted P (x, y), and is independent of t. The values P (x, y) are called the transition probabilities of the chain. We can also think of a Markov chain as a process on a directed graph G = (V,E), where V is the range of values taken by the Xt (assumed disc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1979
ISSN: 0166-218X
DOI: 10.1016/0166-218x(79)90043-x